lst1=['A','B','C']
lst2=[0,0,0]
in1=input()
in2=input()
in3=input()
s=""
if(in1[1]=='>'):
temp=in1[0]
lst2[lst1.index((temp))]=lst2[lst1.index((temp))]+1
elif(in1[1]=='<'):
temp=in1[2]
lst2[lst1.index((temp))]=lst2[lst1.index((temp))]+1
if(in2[1]=='>'):
temp=in2[0]
lst2[lst1.index((temp))]=lst2[lst1.index((temp))]+1
elif(in2[1]=='<'):
temp=in2[2]
lst2[lst1.index((temp))]=lst2[lst1.index((temp))]+1
if(in3[1]=='>'):
temp=in3[0]
lst2[lst1.index((temp))]=lst2[lst1.index((temp))]+1
elif(in3[1]=='<'):
temp=in3[2]
lst2[lst1.index((temp))]=lst2[lst1.index((temp))]+1
if(lst2[0]==lst2[1]==lst2[2]==1):
s="Impossible"
else:
for i in range(0,3):
t=lst2.index(min(lst2))
s=s+lst1[t]
lst2[t]=100
print(s)
#include <cstdio>
#include <iostream>
#include <map>
int main(){
std::map<char,int> count;
count.insert(std::pair<char,int>('A',0));
count.insert(std::pair<char,int>('B',0));
count.insert(std::pair<char,int>('C',0));
for(int k = 0; k < 3; k++){
std::string temp; getline(std::cin, temp);
if(temp[1] == '<'){++count[temp[2]];}
else{++count[temp[0]];}
}
if(count['A'] == 1 && count['B'] == 1 && count['C'] == 1){puts("Impossible");}
else{
if(count['A'] == 0){printf("A");}
else if(count['B'] == 0){printf("B");}
else if(count['C'] == 0){printf("C");}
if(count['A'] == 1){printf("A");}
else if(count['B'] == 1){printf("B");}
else if(count['C'] == 1){printf("C");}
if(count['A'] == 2){printf("A");}
else if(count['B'] == 2){printf("B");}
else if(count['C'] == 2){printf("C");}
}
puts("");
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |